std::minmax |
您所在的位置:网站首页 › min{max} › std::minmax |
C++
Compiler support
Freestanding and hosted
Language
Standard library
Standard library headers
Named requirements
Feature test macros (C++20)
Language support library
Concepts library (C++20)
Metaprogramming library (C++11)
Diagnostics library
General utilities library
Strings library
Containers library
Iterators library
Ranges library (C++20)
Algorithms library
Numerics library
Localizations library
Input/output library
Filesystem library (C++17)
Regular expressions library (C++11)
Concurrency support library (C++11)
Technical specifications
Symbols index
External libraries
[edit] Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Execution policies (C++17)
is_execution_policy(C++17)
execution::seqexecution::parexecution::par_unseqexecution::unseq(C++17)(C++17)(C++17)(C++20)
execution::sequenced_policyexecution::parallel_policyexecution::parallel_unsequenced_policyexecution::parallel_unsequenced(C++17)(C++17)(C++17)(C++20)
Non-modifying sequence operations
all_ofany_ofnone_of(C++11)(C++11)(C++11)
for_each
for_each_n(C++17)
countcount_if
mismatch
equal
adjacent_find
search
search_n
lexicographical_compare
lexicographical_compare_three_way(C++20)
findfind_iffind_if_not(C++11)
find_end
find_first_of
Modifying sequence operations
copycopy_if(C++11)
copy_n(C++11)
copy_backward
move(C++11)
move_backward(C++11)
shift_leftshift_right(C++20)(C++20)
transform
fill
fill_n
generate
generate_n
swap
iter_swap
swap_ranges
sample(C++17)
removeremove_if
replacereplace_if
reverse
rotate
unique
random_shuffle(until C++17)
remove_copyremove_copy_if
replace_copyreplace_copy_if
reverse_copy
rotate_copy
unique_copy
shuffle(C++11)
Partitioning operations
is_partitioned(C++11)
partition_point(C++11)
partition
partition_copy(C++11)
stable_partition
Sorting operations
is_sorted(C++11)
is_sorted_until(C++11)
sort
stable_sort
partial_sort
partial_sort_copy
nth_element
Binary search operations
lower_bound
upper_bound
binary_search
equal_range
Set operations (on sorted ranges)
merge
inplace_merge
set_difference
set_intersection
set_symmetric_difference
set_union
includes
Heap operations
is_heap(C++11)
is_heap_until(C++11)
make_heap
sort_heap
push_heap
pop_heap
Minimum/maximum operations
max
max_element
min
min_element
minmax(C++11)
minmax_element(C++11)
clamp(C++17)
Permutations
is_permutation(C++11)
next_permutation
prev_permutation
Numeric operations
iota(C++11)
inner_product
adjacent_difference
accumulate
reduce(C++17)
transform_reduce(C++17)
transform_inclusive_scan(C++17)
transform_exclusive_scan(C++17)
partial_sum
inclusive_scan(C++17)
exclusive_scan(C++17)
Operations on uninitialized storage
uninitialized_copy
uninitialized_move(C++17)
uninitialized_fill
uninitialized_copy_n(C++11)
uninitialized_move_n(C++17)
uninitialized_fill_n
uninitialized_default_construct(C++17)
uninitialized_value_construct(C++17)
uninitialized_default_construct_n(C++17)
uninitialized_value_construct_n(C++17)
destroy(C++17)
destroy_n(C++17)
destroy_at(C++17)
construct_at(C++20)
C library
qsort
bsearch
[edit]
Defined in header
(1)
template
std::pair minmax_element( ForwardIt first, ForwardIt last ); (since C++11) (until C++17) templateconstexpr std::pair minmax_element( ForwardIt first, ForwardIt last ); (since C++17) templatestd::pair minmax_element( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last ); (2) (since C++17) (3) templatestd::pair minmax_element( ForwardIt first, ForwardIt last, Compare comp ); (since C++11) (until C++17) templateconstexpr std::pair minmax_element( ForwardIt first, ForwardIt last, Compare comp ); (since C++17) templatestd::pair minmax_element( ExecutionPolicy&& policy, ForwardIt first, ForwardIt last, Compare comp ); (4) (since C++17)Finds the smallest and greatest element in the range [first, last). 1) Elements are compared using operator |
今日新闻 |
推荐新闻 |
CopyRight 2018-2019 办公设备维修网 版权所有 豫ICP备15022753号-3 |